Relative (pn,p,pn,n)-difference sets with GCD(p,n)=1
نویسندگان
چکیده
منابع مشابه
A Brief Survey of Difference Sets, Partial Difference Sets, and Relative Difference Sets
Difference sets, partial difference sets, and relative difference sets are algebraic structures with combinatorial applications. The purpose of this paper is to give the reader definitions and basic examples of these sets, as well describe their connections to some other well-known combinatorial objects. We will conclude with some examples that illustrate how character theory can be used to pro...
متن کاملRelative Difference Sets Partitioned by Cosets
We explore classical (relative) difference sets intersected with the cosets of a subgroup of small index. The intersection sizes are governed by quadratic Diophantine equations. Developing the intersections in the subgroup yields an interesting class of group divisible designs. From this and the Bose-Shrikhande-Parker construction, we obtain some new sets of mutually orthogonal latin squares. W...
متن کاملSemifields, Relative Difference Sets, and Bent Functions
Recently, the interest in semifields has increased due to the discovery of several new families and progress in the classification problem. Commutative semifields play an important role since they are equivalent to certain planar functions (in the case of odd characteristic) and to modified planar functions in even characteristic. Similarly, commutative semifields are equivalent to relative dif...
متن کاملTwo Generalized Constructions of Relative Difference Sets
We give two generalizations of some known constructions of relative difference sets. The first one is a generalization of a construction of RDS by Chen, Ray-Chaudhuri and Xiang using the Galois ring GR(4,m). The second one generalizes a construction of RDS by Ma and Schmidt from the setting of chain rings to a setting of more general rings.
متن کاملGirth 5 graphs from relative difference sets
We consider the problem of construction of graphs with given degree k and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G. Royle, four of the known cages including the Hoffman-Singleton graph, some graphs constructed by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2008
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-008-0124-5